Resilience and Quality of Life in Caregivers of Schizophrenia and Bipolar Disorder Patients

The present study was designed to explore the resilience amongst caregivers of individuals diagnosed with schizophrenia and bipolar disorder and also to examine whether resilience affects an individual s quality of life For this purpose a sample of 50 caregivers 25 from each group residing with the patients aged between 20-70 years was selected from psychiatry department of hospitals and organizations and clinics dealing with the mentally ill persons located in Delhi National Capital Region India Two standardized instruments World Health Organization Quality of Life BREF and the Connor-Davidson Resilience Scale were used for the study Results indicated resilience to be same in both the groups of caregivers i e there was no significant difference between resilience in caregivers of schizophrenic patients and bipolar disorder patients There was a significant correlation between the quality of life and resilience in caregivers of individuals diagnosed with schizophrenia and bipolar disorder The present study however did not to compare the obtained results with a normal group of individuals to see if and how their quality of life and resilience differ from that of caregivers The implication of this would be to work on a rehabilitation program that would focus on improving the financial factor and entertainment aspect of caregivers that would eventually maintain a good quality of life and in turn enhance their coping skills and resilience as wel

Comparison of Level of Alexithymia in Individual with Different Sexual Orientation

Alexithymia has been affecting the lives of people in many ways though the affect is seen not immediately Sometimes it happens so subtly that other reasons with loud appearance are the only ones to be addressed leaving behind the unfinished business keeping the question still unanswered or vice versa Sexual Orientation on the other hand had been constantly gaining attention from various disciplines including psychology medicine and law Researchers have significantly associated sexual orientation with mental health The present research aimed to study the relationship between alexithymia and sexual orientation In the study 60 heterosexuals 5 bisexuals and 60 homosexuals N 125 were included After filling up informed consent they completed personal data sheet General health Questionnaire GHQ- 12 Klein Sexual Orientation Grid KSOG and Toronto Alexithymia Scale TAS-20 The results did not show correlation between alexithymia and sexual orientation r 0 03 p 0 75 However on further analysis significant negative correlation r -0 60 p 0 02 with high alexithymic scor

Comparative Analysis of Objective Functions in Routing Protocol for Low Power and Lossy Networks

Internet-of-Things (IoT), a new paradigm, has led to the extensive increase in communication among the tiny and embedded network devices. Majority of those devices are power, memory, and energy constrained and are made to work in lossy environments, thus forming an important part of Low Power and Lossy Networks (LLNs). Routing Protocol for Low Power and Lossy Networks (RPL) designed by Internet Engineering Task Force (IETF) is proved to be an effective candidate for routing in such networks. RPL defines the Objective Functions (OFs) in which a set of routing metrics (like hop count, ETX and so on) are used either in an individual or combined manner for optimal path selection between the nodes of the network in terms of various performance factors like power consumed, Packet Delivery Ratio (PDR), reliability and so on. There are two standard Objective Functions- Objective function Zero (OF0) and Minimum Rank Hysteresis Objective Function (MRHOF). The former uses the hop count and the latter uses the Expected Transmission Count (ETX) as the default routing metrics to select the optimal paths. But both of them are single metric Objective Functions (OFs) and have to face various issues regarding the energy consumed, network lifetime and so on. So a number of RPL optimizations incorporating the different routing metrics in a combined way have been proposed to enhance the performance in all respects. This paper gives the comparative analysis of existing Objective Functions that are based on different routing metrics and concludes that the use of a combination of multiple metrics will further improve the RPL performance in future

On A Chain Involving the Multivariable I-Transform I

In the present paper, we first establish an interesting new chain interconnecting a number of multivariable I-transform of Prathima et al. [6] by the method of mathematical induction. Full care has been taken of all the convergence and existence conditions for the validity of the chain. The chain established herein has been put in a very compact form and it exhibits an interesting relationship existing between images and originals of a series of related functions in several multidimensional I-function. The importance of our findings lies in the fact that it involves the multivariable I-function which is sufficiently general in nature and so a large number of chains involving other simpler and useful integral transforms of one and more variables follow as special ceses of our chain merely by specializing the parameters. In the end, we shall see several corollaries

A Survey on Trickle Algorithm: Comparative Analysis

Internet of Things (IoT) is an emerging area in the field of wireless communication. Due to its resource constraint environment, IETF gave a standard for IVP6 routing protocol for low power and lossy networks (RPL). The major component of RPL is Trickle algorithm. It is used to control the number of messages exchanged between devices and helps in early network stabilization. Due to its importance, it is crucial for researchers to understand this protocol. The absence of surveys in Trickle Algorithm motivates us to write this paper. In this paper, we compared different Trickle Algorithms based on performance parameters like convergence time, energy consumption, packet delivery ratio and others. Concluding, we can say that it is open research area in the designing parameters of Trickle�s Algorithms and we believe that this survey will be beneficial for researchers in their relevant work

Use of Clustering-based Routing Protocols in Low Power and Lossy Networks � A Survey

Internet of Things (IoT) is the one of the emerging field today, which consists of various resource-constrained devices that are limited in resources and work in the lossy wireless network. Therefore, IoT requires efficient routing protocol so that devices can communicate fast and power efficiently. Among different protocols available for wireless networks, Routing Protocol for Low Power and Lossy Networks (RPL) is a protocol specially standardized by IETF for efficient communication between IoT devices. Routing technique is one of the important factors of a routing protocol, which affects the performance of a protocol. In recent years, researchers contributed to improving RPL performance by providing various solutions and clustering is one of those ways to improve RPL performance by using Cluster- parent based Destination Oriented Directed Acyclic Graph (DODAG). In this paper, we discuss the various clustering-based routing protocols in a Low power and lossy networks (LLNs) and concludes that this survey might be helpful for future researchers

A Study of Data Security on E-Governance using Steganographic Optimization Algorithms

Steganography has been used massively in numerous fields to maintain the privacy and integrity of messages transferred via the internet. The need to secure the information has augmented with the increase in e-governance usage. The wide adoption of e-governance services also opens the doors to cybercriminals for fraudulent activities in cyberspace. To deal with these cybercrimes we need optimized and advanced steganographic techniques. Various advanced optimization techniques can be applied to steganography to obtain better results for the security of information. Various optimization techniques like particle swarm optimization and genetic algorithms with cryptography can be used to protect information for e-governance services. In this study, a comprehensive review of steganographic algorithms using optimization techniques is presented. A new perspective on using this technique to protect the information for e-governance is also presented. Deep Learning might be the area that can be used to automate the steganography process in combination with other method

Role of Vajraka Taila in the management of Vrana

In today’s busy and fast life more people are living with conditions that increase their susceptibility to traumatic wounds, due to one or the other cause; thereby taking a heavy toll of life. As per Ayurveda, these type of wounds, which are caused by extrinsic factors are known as Sadyovrana. The major aspect of the management of the traumatic wounds is prevention of the infection, speedy healing, reducing pain, discharge and less discoloration after healing. In Ayurveda, various formulations for debridement are mentioned such as Kwaatha, Kalka, Churna, Rasakriya, Varti, Taila and Ghrita depending on the Avastha of Vrana. In the present study use of Vajraka Taila for external application, has been chosen. Total 30 patients fulfilling the inclusion criteria were selected and the treatment was given for 15 days. The study showed that Vajraka Taila is very effective in Vrana

HT-FED2004-56013 MODELLING OF SLURRY-HANDLING PIPING ELEMENT UNDER INTERFERENCE CONDITIONS

ABSTRACT The paper presents a new approach to predict the two-phase performance of jet-pumps under interference conditions. We limit our study mainly to diffuser and transport regions of the jet pump. The five essential pre-requisites which form the backbone of our approach are a fairly generalized and accurate approach to (i) solid-fluid interaction, (ii) particle diffusion under generalized flow field, (iii) friction factor-Reynolds number equation, (iv) solid-fluid flow through ducts and (v) mixing of primary and secondary jets using the approach of Wang et al

Bounds on the Complexity of Halfspace Intersections when the Bounded Faces have Small Dimension

We study the combinatorial complexity of D-dimensional polyhedra defined as the intersection of n halfspaces, with the property that the highest dimension of any bounded face is much smaller than D. We show that, if d is the maximum dimension of a bounded face, then the number of vertices of the polyhedron is O(n^d) and the total number of bounded faces of the polyhedron is O(n^d^2). For inputs in general position the number of bounded faces is O(n^d). For any fixed d, we show how to compute the set of all vertices, how to determine the maximum dimension of a bounded face of the polyhedron, and how to compute the set of bounded faces in polynomial time, by solving a polynomial number of linear programs